Numerical and analytical bounds on threshold error rates for hypergraph-product codes
نویسندگان
چکیده
We study analytically and numerically decoding properties of finite rate hypergraph-product quantum LDPC codes obtained from random (3, 4)-regular Gallager codes, with a simple model of independent X and Z errors. Several non-trival lower and upper bounds for the decodable region are constructed analytically by analyzing the properties of the homological difference, equal minus the logarithm of the maximum-likelihood decoding probability for a given syndrome. Numerical results include an upper bound for the decodable region from specific heat calculations in associated Ising models, and a minimum weight decoding threshold of approximately 7%.
منابع مشابه
On the Weight Enumerator and the Maximum Likelihood Performance of Linear Product Codes
Product codes are widely used in data-storage, optical and wireless applications. Their analytical performance evaluation usually relies on the truncated union bound, which provides a low error rate approximation based on the minimum distance term only. In fact, the complete weight enumerator of most product codes remains unknown. In this paper, concatenated representations are introduced and a...
متن کاملAn approach to fault detection and correction in design of systems using of Turbo codes
We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...
متن کاملPerformance bounds for coded free-space optical communications through atmospheric turbulence channels
Error-control codes can help to mitigate atmospheric turbulence-induced signal fading in free-space optical communication links using intensity modulation/direct detection (IM/DD). Error performance bound analysis can yield simple analytical upper bounds or approximations to the bit-error probability. In this letter, we first derive an upper bound on the pairwise codeword-error probability for ...
متن کاملDesign of Rate-Compatible Serially Concatenated Convolutional Codes
Recently a powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) have been proposed based on minimizing analytical upper bounds on the error probability in the error floor region. Here this class of codes is further investigated by combining analytical upper bounds with extrinsic information transfer charts analysis. Following this approach, we construct a family o...
متن کاملOn the design of rate-compatible serially concatenated convolutional codes
A powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) has been proposed based on minimizing analytical upper bounds on the error probability in the error floor region. In this paper, this class of codes is further investigated by combining analytical upper bounds with extrinsic information transfer chart analysis to improve performance in the waterfall region. Fo...
متن کامل